Time-frequency analysis with best local cosine bases
نویسندگان
چکیده
We propose new best basis search algorithms for local cosine dictionaries. We provide several algorithms for dictionaries of various complexity. Our framework generalizes the classical best local cosine basis selection based on a dyadic tree [1].
منابع مشابه
Optimal Time-Frequency Bases for EEG Signal Classification in the Context of BCI
We consider the problem of classifying multi-sensor signals, more precisely EEG signals in the context of Brain Computer Interfaces (BCI), by selection of time-frequency features. The features are determined among local cosine bases (MDCT) by a “best basis” type algorithm adapted to the classification context. In the BCI domain, or more generally in neuroscience, many classification algorithms ...
متن کاملA Signal-adaptive Local Cosine Transform for Source Separation by Time-frequency Masking
Time-frequency masking is often used for source separation of underdetermined audio mixtures. It depends on the fact that the sources can be represented disjointly in some transform domain. The focus of this paper is on demixing sources from instantaneous, two-channel mixtures by binary masking. We investigate trees of local cosine bases from which a suitable transform may be generated—the best...
متن کاملComparative study of shift-invariant symmetric wavelets and cosine local discriminant basis in noisy transients classification
Linear transforms in the time-frequency domain have proven very effective for non-stationary signal analysis. As such, wavelets and local trigonometric transforms have attracted substantial attention during the last decade and both methods have undergone extensive refinement. One recent development is the availability of algorithms for wavelet design and shift-invariant (SI) algorithms for both...
متن کاملSatisficing search algorithms for selecting near-best bases in adaptive tree-structured wavelet transforms
Satisficing search algorithms are proposed for adaptively selecting near-best basis and near-best frame decompositions in redundant tree-structured wavelet transforms. Any of a variety of additive or non-additive information cost functions can be used as the decision criterion for comparing and selecting nodes when searching through the tree. The algorithms are applicable to tree-structured tra...
متن کاملComparison of Propagator Decomposition in Seismic Imaging by Wavelets, Wavelet-packets, and Local Harmonics
Kirchhoo migration operator is a highly oscillatory integral operator. In our primary work 1] (Wu and Yang, 1997), it has been shown that the matrix representation of Kirchhoo migration operator for homogeneous background in space-frequency domain is a dense matrix, while the compressed operator in beamlet-frequency domain, which is the wavelet decomposition of the Kirchhoo migration operator, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004